Study of Sorting Error Distribution on Automatic Sorting Machines
نویسندگان
چکیده
منابع مشابه
On Implementing Sorting Network Machines with FPGAs
This paper presents two implementations of sorting network machines, bearing in mind embedded computing systems. In the proposed implementations, the hardware is reused by iteratively performing the sorting algorithm. The two implementations have been tested using Field Programmable Gate Arrays (FPGAs). Experimental results show the differences in performance, area, and power dissipation betwee...
متن کاملError-Resilient Block Sorting
“Blocksorting Transform” (BWT) is a lossless compression technique that has become increasingly popular in recent years due to the fact that it achieves high performance compression (almost as good as in PPM, with fast speed (not much slower than gZip). It is perhaps the first lossless compression algorithm to combine these two properties. BWT breaks its input into large blocks, and performs an...
متن کاملFast deterministic sorting on large parallel machines
Many sorting algorithms that perform well on uniformly distributed data suffer significant performance degradation on non-random data. Unfortunately many real-world applications require sorting on data that is not uniformly distributed. In this paper, we consider distributions of varying entropies. We describe A-Ranksort, a new sorting algorithm for parallel machines, whose behavior on input di...
متن کاملThroughput optimization of automated flats sorting machines
Large letters, journals, magazines, plastic wrapped mail items of A4 size are called flats. In order to be able to handle the large volumes of flats that have to be processed state-ofthe-art post sorting centers are equipped with dedicated flats sorting machines. The throughput of a flats sorting machine is crucial when dealing with a continually increasing number of items to be sorted in a cer...
متن کاملEfficient Implementation of Sorting Algorithms on Asynchronous Distributed-Memory Machines
The problem of merging two sequences of elements which are stored separately in two processing elements (PEs) occurs in the implementation of many existing sorting algorithms. We describe efficient algorithms for the merging problem on asynchronous distributed-memory machines. The algorithms reduce the cost of the merge operation and of communication, as well as partly solving the problem of lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Japan Society of Precision Engineering
سال: 1977
ISSN: 0374-3543
DOI: 10.2493/jjspe1933.43.445